A Potts Neural Network Heuristic for the Class/Teacher Timetabling Problem
نویسندگان
چکیده
Timetabling problems emerge in many variations [9], depending on the nature of the assignments involved (exam timetabling, course timetabling, school timetabling and others), as well as, the characteristics of the institution and the set of constraints assumed. In this communication we focus on a particular school timetabling problem the Class/Teacher Timetabling Problem (CTTP) that will be described in section 2.
منابع مشابه
A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem
This study explores the application of neural network-based heuristics to the class/teacher timetabling problem (CTTP). The paper begins by presenting the basic CTTP characteristics in terms of hard and soft constraints and proposing a formulation for the energy function required to map the problem within the artificial neural network model. There follow two distinct approaches to simulating ne...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملAn Evolutionary Approach to the School Timetabling Problem
We present a general heuristic technique that solves a timetabling problem, such as school timetabling. It is based on a Hopfield-type neural network, whose complexity was significantly reduced by incorporating a genetic algorithm into a very first stage of the timetabling process. The goal of the GA was to initialize the network so that the number of neurons and their connections decreased, an...
متن کاملModelling and solving an acyclic multi-period timetabling problem
In this article a special case of the class-teacher timetabling problem is described. This case takes into consideration a partial ordering between the topics of the curriculum and special requirements in respect to their daily lectures. The problem is modelled as a discrete lexicographic optimization problem. A heuristic procedure for solving the problem is developed. The method represents a c...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کامل